Ventriculogram segmentation using boosted decision trees
نویسندگان
چکیده
Left ventricular status, reflected in ejection fraction or end systolic volume, is a powerful prognostic indicator in heart disease. Quantitative analysis of these and other parameters from ventriculograms is infrequently performed due to the expense of manual segmentation. We present a method for semi-automatic segmentation of ventriculograms based on a two-stage boosted decision-tree pixel classifier. The classifier determines which pixels are inside the ventricle at key end-diastole and end-systole frames. The classifier is semi-automatic, requiring a user to select 3 points in each frame: the endpoints of the aortic valve and the apex. The classifier uses about 90 feature images, computed from the raw ventriculogram image frames, including simple per pixel gray-level statistics (e.g. median brightness) and image geometry (e.g. coordinates relative to user supplied 3 points). Border pixels are determined from segmented images using dilation and erosion. A curve is then fit to the border pixels, minimizing a penalty function that trades off fidelity to the border pixels with smoothness. Volumes and ejection fraction are estimated from border curves using standard area-length formulas. On independent test data, the differences between automatic and manual volumes (and ejection fractions) are similar in size to the differences between two human observers.
منابع مشابه
Improving segmentation accuracy for magnetic resonance imaging using a boosted decision tree.
The purpose of this study was to improve the accuracy rate of brain tissue classification in magnetic resonance (MR) imaging using a boosted decision tree segmentation algorithm. Herein, we examined simulated phantom MR (SPMR) images, simulated brain MR (SBMR) images, and a real data. The accuracy rate and k index when classifying brain tissues as gray matter (GM), white matter (WM), or cerebra...
متن کاملCredit scoring with boosted decision trees
The enormous growth experienced by the credit industry has led researchers to develop sophisticated credit scoring models that help lenders decide whether to grant or reject credit to applicants. This paper proposes a credit scoring model based on boosted decision trees, a powerful learning technique that aggregates several decision trees to form a classifier given by a weighted majority vote o...
متن کاملTagging heavy flavours with boosted decision trees
This paper evaluates the performance of boosted decision trees for tagging b-jets. It is shown, using a Monte Carlo simulation of WH → lνqq̄ events that boosted decision trees outperform feed-forward neural networks. The results show that for a b-tagging efficiency of 90% the b-jet purity given by boosted decision trees is almost 20% higher than that given by neural networks.
متن کاملIntelligent Analysis of Marketing Data
The main goal of this paper is to present and evaluate the possibility of using the methods and tools of Artificial Intelligence and Data Mining to analyze marketing data needed to support decision-making in the process of market segmentation. This paper describes the application of Kohonen’s Neural Networks and Classification Trees (including tools such as CART-Classification and Regression Tr...
متن کاملA multivariate approach to heavy flavour tagging with cascade training
This paper compares the performance of artificial neural networks and boosted decision trees, with and without cascade training, for tagging b-jets in a collider experiment. It is shown, using a Monte Carlo simulation of WH → lνqq̄ events, that boosted decision trees outperform artificial neural networks. Furthermore, cascade training can substantially improve the performance of both boosted dec...
متن کامل